Factoring Integers by CVP Algorithms
نویسنده
چکیده
We use pruned enumeration algorithms to find lattice vectors close to a specific target vector for the prime number lattice. These algorithms generate multiplicative prime number relations modulo N that factorize a given integer N . The algorithm New Enum performs the stages of exhaustive enumeration of close lattice vectors in order of decreasing success rate. For example an integer N ≈ 10 can be factored by about 90 prime number relations modulo N for the 90 smallest primes. Our randomized algorithm generated for example 136 such relations in 15 minutes. It is a challenge to optimize this method towards factorizing integers in average polynomial time.
منابع مشابه
Quantum algorithms for computing short discrete logarithms and factoring RSA integers
In this paper we generalize the quantum algorithm for computing short discrete logarithms previously introduced by Eker̊a [2] so as to allow for various tradeoffs between the number of times that the algorithm need be executed on the one hand, and the complexity of the algorithm and the requirements it imposes on the quantum computer on the other hand. Furthermore, we describe applications of al...
متن کاملQuantum Algorithms for Computing Short Discrete Logarithms and Factoring RSA Integers
In this paper we generalize the quantum algorithm for computing short discrete logarithms previously introduced by Eker̊a [2] so as to allow for various tradeoffs between the number of times that the algorithm need be executed on the one hand, and the complexity of the algorithm and the requirements it imposes on the quantum computer on the other hand. Furthermore, we describe applications of al...
متن کاملFactoring Small Integers: An Experimental Comparison
In this data-based paper we report on our experiments in factoring integers from 50 to 200 bits with the postsieving phase of NFS as a potential application. We implemented and compared several general-purpose factoring algorithms suited for these smaller numbers, from Shanks’s square form factorization method to the self-initializing quadratic sieve, and revisited the older continued fraction ...
متن کاملFactoring Integers Using the Web
This note provides background on the www-factoring project, which was started in the fall of 1995. Factoring a positive integer ri means finding two positive integers u and v such that the product of u and v equals ri, and such that both u a.nd v are greater than 1. Such u and v are called factors (or divisors) of ii, and n = u v is called a factorization of n. Positive integers that ca.n be fa...
متن کاملOn the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms
To prove or disprove the computational equivalence of solving the RSA problem and factoring integers is a longstanding open problem in cryptography. This paper provides some evidence towards the validity of this equivalence. We show that any e cient generic ring algorithm which solves the ( exible) low-exponent RSA problem can be converted into an e cient factoring algorithm. Thus, the low-expo...
متن کامل